Nearest Q-flat to M Points 1
نویسنده
چکیده
Recently, Bradley and Mangasarian [1] studied the problem of finding the nearest plane to m given points in Rn in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n× n symmetric positive semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0 ≤ q ≤ n− 1.
منابع مشابه
Group Nearest Neighbor Queries in the L 1 Plane
Let P be a set of n points in the plane. The k-nearest neighbor (k-NN) query problem is to preprocess P into a data structure that quickly reports k closest points in P for a query point q. This paper addresses a generalization of the k-NN query problem to a query set Q of points, namely, the group nearest neighbor problem, in the L1 plane. More precisely, a query is assigned with a set Q of at...
متن کاملStability Analysis for Wake Flow Behind a Flat Plate
Neutral stability limits for wake flow behind a flat plate is studied using spectral method. First, Orr-Sommerfeld equation was changed to matrix form, covering the whole domain of solution. Next, each term of matrix was expanded using Chebyshev expansion series, a series very much equivalent to the Fourier cosine series. A group of functions and conditions are applied to start and end points i...
متن کاملSymmetries of Flat Rank Two Distributions and Sub-riemannian Structures
Flat sub-Riemannian structures are local approximations — nilpotentizations — of sub-Riemannian structures at regular points. Lie algebras of symmetries of flat maximal growth distributions and sub-Riemannian structures of rank two are computed in dimensions 3, 4, and 5. 1. Sub-Riemannian structures A sub-Riemannian geometry is a triple (M,∆, 〈·, ·〉), where M is a smooth manifold, ∆ ⊂ TM is a s...
متن کاملNearest Neighbors Problem
DEFINITION Given a set of n points and a query point, q, the nearest-neighbor problem is concerned with finding the point closest to the query point. Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q. The right shows the problem solution, s. Figure 1: An example of a nearest-neighbor problem dom...
متن کاملStability Analysis for Wake Flow Behind a Flat Plate
Neutral stability limits for wake flow behind a flat plate is studied using spectral method. First, Orr-Sommerfeld equation was changed to matrix form, covering the whole domain of solution. Next, each term of matrix was expanded using Chebyshev expansion series, a series very much equivalent to the Fourier cosine series. A group of functions and conditions are applied to start and end points i...
متن کامل